Redundancy Free Mappings from Relations to XML
نویسندگان
چکیده
Given the fact that relational and object relational databases are the most widely used technology for storing data and that XML is the standard format used in electronic data interchange the process of con verting relational data to XML documents is one that occurs frequently The problem that we address in this paper is an important one related to this process If we convert a relation to an XML document under what circumstances is the XML document redundancy free Drawing on some previous work by the authors that formally de ned functional dependencies and redundancy in XML documents we show that for a very general class of mappings from a relation to an XML document the XML document is always redundancy free if and only if the relation is in Boyce Codd normal form BCNF
منابع مشابه
Redundancy Free Mappings from relations toXMLMillist
Given the fact that relational and object-relational databases are the most widely used technology for storing data and that XML is the standard format used in electronic data interchange, the process of converting relational data to XML documents is one that occurs frequently. The problem that we address in this paper is an important one related to this process. If we convert a relation to an ...
متن کاملQuery Decomposition Using the XML Declarative Description Language
Query decomposition is one of the most important phases of query processing in an integrated database system. A global query is decomposed into several sub-queries conforming to local formats, which can be used to extract data from distributed databases. In this paper a new query decomposition methodology for integrated XML databases is introduced. A special construction of mappings is also int...
متن کاملStrong Functional Dependencies and a Redundancy Free Normal Form for XML
In this paper we address the problem of how to extend the deenition of functional dependencies (FDs) in incomplete relations to XML documents. There are two complementary approaches to deening functional dependencies (FDs) in incomplete relational databases. The rst approach, called the weak satisfaction approach, deenes a FD to be weakly satissed in an incomplete relation if there is at least ...
متن کاملXyView: Universal Relations Revisited
We present XyView, a practical solution for fast development of user(web forms) and machine-oriented applications (web services) over a repository of heterogeneous schema-free XML documents. XyView provides the means to view such a repository as an array that can be queried using a QBE-like interface or through simple selection/projection queries. It extends the concept of universal relations i...
متن کاملTowards ensuring Satisfiability of Merged Ontology
The last decade has seen researchers developing efficient algorithms for the mapping and merging of ontologies to meet the demands of interoperability between heterogeneous and distributed information systems. But, still state-of-the-art ontology mapping and merging systems is semi-automatic that reduces the burden of manual creation and maintenance of mappings, and need human intervention for ...
متن کامل